%0 Conference Proceedings
%4 sid.inpe.br/banon/2004/08.06.11.34
%2 sid.inpe.br/banon/2004/08.06.11.34.53
%@doi 10.1109/SIBGRA.2004.1352982
%T Loop Snakes: Snakes with Enhanced Topology Control
%D 2004
%A Oliveira, Antonio,
%A Ribeiro, Saulo,
%A Farias, Ricardo,
%A Esperança, Cláudio,
%A Giraldi, Gilson,
%@affiliation Dept. of Systems Engineering and Computer Sciences - COPPE/UFRJ
%@affiliation National Lab. of Scientific Computing - LNCC
%E Araújo, Arnaldo de Albuquerque,
%E Comba, João Luiz Dihl,
%E Navazo, Isabel,
%E Sousa, Antônio Augusto de,
%B Brazilian Symposium on Computer Graphics and Image Processing, 17 (SIBGRAPI) - Ibero-American Symposium on Computer Graphics, 2 (SIACG)
%C Curitiba, PR, Brazil
%8 17-20 Oct. 2004
%I IEEE Computer Society
%J Los Alamitos
%S Proceedings
%K topologically adaptable snakes, T-snakes, segment identification, loop, topology.
%X Topologically adaptable snakes, or simply T-snakes, are a standard tool for automatically identifying multiple segments in an image. This work introduces a novel approach for controlling the topology of a T-snake. It focuses on the loops formed by the so-called projected curve which is obtained at every stage of the snake evolution. The idea is to make that curve the image of a piecewise linear mapping of an adequate class. Then, with the help of an additional structure—the Loop-Tree—it is possible to decide in O(1) time whether the region enclosed by each loop has already been explored by the snake. This makes it possible to construct an enhanced algorithm for evolving T-snakes whose performance is assessed by means of statistics and examples.
%@language en
%3 5.pdf